A Compositional Hierarchical Monitoring Automaton Construction for LTL
نویسندگان
چکیده
In this paper we give a compositional (or inductive) construction of monitoring automata for LTL formulas. Our construction is similar in spirit to the compositional construction of Kesten and Pnueli [5]. We introduce the notion of hierarchical Büchi automata and phrase our constructions in the framework of these automata. We give detailed constructions for all the principal LTL operators including past operators, along with proofs of correctness of the constructions.
منابع مشابه
From LTL to Deterministic Automata: A Safraless Compositional Approach
We present a new algorithm to construct a deterministic Rabin automaton for an LTL formula φ. The automaton is the product of a master automaton and an array of slave automata, one for each Gsubformula of φ. The slave automaton for Gψ is in charge of recognizing whether FGψ holds. As opposed to standard determinization procedures, the states of all our automata have a clear logical structure, w...
متن کاملFrom Propositional to First-Order Monitoring
The main purpose of this paper is to introduce a first-order temporal logic, LTL, and a corresponding monitor construction based on a new type of automaton, called spawning automaton. Specifically, we show that monitoring a specification in LTL boils down to an undecidable decision problem. The proof of this result revolves around specific ideas on what we consider a “proper” monitor. As these ...
متن کاملA From LTL to Deterministic Automata–A Safraless Compositional Approach
We present a new algorithm to construct a (generalized) deterministic Rabin automaton for an LTL formula φ. The automaton is the product of a co-Büchi automaton for φ and an array of Rabin automata, one for each G-subformula of φ. The Rabin automaton for Gψ is in charge of recognizing whether FGψ holds. This information is passed to the co-Büchi automaton that decides on acceptance. As opposed ...
متن کاملOn the Merits of Temporal Testers
The paper discusses the merits of temporal testers, which can serve as a compositional basis for automata construction corresponding to temporal formulas in the context of LTL, PSL, and MITL logics. Temporal testers can be viewed as (non-deterministic) transducers that, at any point, output a boolean value which is 1 iff the corresponding temporal formula holds starting at the current position....
متن کاملPSL Model Checking and Run-Time Verification Via Testers
The paper introduces the construct of temporal testers as a compositional basis for the construction of automata corresponding to temporal formulas in the PSL logic. Temporal testers can be viewed as (non-deterministic) transducers that, at any point, output a boolean value which is 1 iff the corresponding temporal formula holds starting at the current position. The main advantage of testers, c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012